Long cyclic codes are good
نویسندگان
چکیده
Long quasi-cyclic codes of any fixed index > 1 have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. Güneri, H. Shoaib, P. Solé, 2017). We use this recent result to construct good long additive cyclic codes on any extension of fixed degree of the base field. Similarly selfdual double circulant codes, and self-dual four circulant codes, have been shown to be good, also depending on Artin primitive root conjecture in (A. Alahmadi, F. Özdemir, P. Solé, 2017) and ( M. Shi, H. Zhu, P. Solé, 2017) respectively. Building on these recent results, we can show that long cyclic codes are good over Fq, for many classes of q’s. This is a partial solution to a fifty year old open problem.
منابع مشابه
Good Self-dual Generalized Quasi-Cyclic Codes Exist
We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.
متن کاملOn shortened and punctured cyclic codes
Abstract. The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes and Reed-Solomon codes are asymptotically bad, however in general the answer to this question is not known. A recent result by Nelson and Van Zwam sh...
متن کاملQuasi-Cyclic Codes from Cyclic-Structured Designs with Good Properties
Quasi-cyclic Codes from Cyclic-Structured Designs with Good Properties Dimitris E. Simos and Christos Koukouvinos Department of Mathematics National Technical University of Athens Zografou 15773, Athens, Greece {dsimos,ckoukouv}@math.ntua.gr Quasi-cyclic (QC) codes form an important class of linear codes, which contains the well-known class of cyclic codes. A linear code with a complementary du...
متن کاملGood Quasi-Cyclic Codes Derived From Irreducible Cyclic Codes
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed. Index Term — Codes and coding, linear codes, cyclic codes, idempotent, irreducible codes, quasi-...
متن کاملGood self-dual quasi-cyclic codes exist
We show that there are long binary quasi-cyclic self-dual (either Type I or Type II) codes satisfying the Gilbert–Varshamov bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.09865 شماره
صفحات -
تاریخ انتشار 2017